\documentclass[11pt,twocolumn]{article}
\usepackage{fullpage}
\textwidth 6.5in
\textheight 9in
\baselineskip 13.2pt

\usepackage[boxed,ruled]{algorithm}
\usepackage{algorithmic}
\usepackage{subfigure}
\usepackage{epsfig,amsthm,amsmath,color, amsfonts}
\usepackage{afterpage}
%\usepackage{epsfig,color}

% Added: Amitabh

\usepackage{graphicx,subfigure,geometry,boxedminipage}
%\usepackage{tikz}
\usepackage{paralist}
%\usepackage{boxedminipage}
\usepackage{setspace}

\newcommand{\xxx}[1]{\textcolor{red}{#1}}
%\usepackage{fullpage}
\usepackage{framed}
\DeclareGraphicsExtensions{.pdf}


%%% Copied from http://www.terminally-incoherent.com/blog/2007/02/04/latex-making-floatng-text-boxes/
%%%%

    \renewcommand{\topfraction}{0.9}
    \renewcommand{\bottomfraction}{0.8}
    \setcounter{topnumber}{2}
    \setcounter{bottomnumber}{2}
    \setcounter{totalnumber}{4}
    \setcounter{dbltopnumber}{2}
    \renewcommand{\dbltopfraction}{0.9}
    \renewcommand{\textfraction}{0.07}
    \renewcommand{\floatpagefraction}{0.7}
%% floatpagefraction MUST be less than topfraction !!
    \renewcommand{\dblfloatpagefraction}{0.7}

%%%
%%%

\renewcommand{\algorithmiccomment}[1]{(#1)}



\newtheorem{theorem}{Theorem}[section]
%\newtheorem{definition}[theorem]{Definition}
\newtheorem{corollary}[theorem]{Corollary}
\newtheorem{proposition}[theorem]{Proposition}
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{claim}[theorem]{Claim}
\newtheorem{conjecture}[theorem]{Conjecture}
%\newtheorem{example}[theorem]{Example}
\newtheorem{remark}[theorem]{Remark}
\theoremstyle{definition}\newtheorem{example}[theorem]{Example}
\theoremstyle{definition}\newtheorem{definition}[theorem]{Definition}
\theoremstyle{observation}\newtheorem{observation}[theorem]{Observation}

\newcommand{\comment}[1]{}
\newcommand{\QED}{\mbox{}\hfill \rule{3pt}{8pt}\vspace{10pt}\par}
%\newcommand{\eqref}[1]{(\ref{#1})}
\newcommand{\theoremref}[1]{(\ref{#1})}
\newenvironment{proof1}{\noindent \mbox{}{\bf Proof:}}{\QED}
%\newenvironment{observation}{\mbox{}\\[-10pt]{\sc Observation.} }%
%{\mbox{}\\[5pt]}

\def\m{{\rm min}}
%\def\m{\bar{m}}
\def\eps{{\epsilon}}
\def\half{{1\over 2}}
\def\third{{1\over 3}}
\def\quarter{{1\over 4}}
\def\polylog{\operatorname{polylog}}
\newcommand{\ignore}[1]{}
\newcommand{\eat}[1]{}
\newcommand{\floor}[1]{\left\lfloor #1 \right\rfloor}
\newcommand{\ceil}[1]{\left\lceil #1 \right\rceil}

\newcommand{\algorithmsize}[0]{}

\newcommand{\cF}{{\mathcal{F}}}
\newcommand{\cR}{{\mathcal{R}}}

%---------------------
%  SPACE SAVERS
%---------------------

%\usepackage{times}
%\usepackage[small,compact]{titlesec}
%\usepackage[small,it]{caption}

\newcommand{\squishlist}{
 \begin{list}{$\bullet$}
  { \setlength{\itemsep}{0pt}
     \setlength{\parsep}{3pt}
     \setlength{\topsep}{3pt}
     \setlength{\partopsep}{0pt}
     \setlength{\leftmargin}{1.5em}
     \setlength{\labelwidth}{1em}
     \setlength{\labelsep}{0.5em} } }
\newcommand{\squishend}{
  \end{list}  }

%---------------------------------
% FOR MOVING PROOFS TO APPENDIX
%\usepackage{answers}
%%\usepackage[nosolutionfiles]{answers}
%\Newassociation{movedProof}{MovedProof}{movedProofs}
%\renewenvironment{MovedProof}[1]{\begin{proof}}{\end{proof}}

\def\e{{\rm E}}
\def\var{{\rm Var}}
\def\ent{{\rm Ent}}
\def\eps{{\epsilon}}
\def\lam{{\lambda}}
\def\bone{{\bf 1}}

\newcommand{\degree}{\mathrm{degree}}
\newcommand{\algoOne}{\textbf{Algo 1}}
\newcommand{\algoTwo}{\textbf{Algo 2}}
\newcommand{\G}{\mathrm{G}}
\newcommand{\V}{\mathrm{V}}
\newcommand{\E}{\mathrm{E}}
\newcommand{\h}{\mathrm{h}}
%\newcommand{\den}{\mathrm{den}}
\newcommand{\den}{\rho}

%------------------------
% Comments
%------------------------


%\def\danupon#1{\marginpar{$\leftarrow$\fbox{D}}\footnote{$\Rightarrow$~{\sf #1 --Danupon}}}
%\def\amitabh#1{\marginpar{$\leftarrow$\fbox{AT}}\footnote{$\Rightarrow$~{\sf #1 --Amitabh}}}
%\def\atish#1{\marginpar{$\leftarrow$\fbox{ADS}}\footnote{$\Rightarrow$~{\sf #1 --Atish}}}


\def\danupon#1{}
\def\amitabh#1{}
\def\atish#1{}


\begin{document}
\title{\bf Dense Subgraphs on Dynamic Networks}

\author{
Atish {Das Sarma}\thanks{eBay Research Labs, San Jose, CA, USA. E-mail: {\tt atish.dassarma@gmail.com}}
%%
\and Ashwin Lall\thanks{Department of Mathematics and Computer Science, Denison University, Granville, OH, USA.}
%%
\and Danupon Nanongkai\thanks{Theory and Applications of Algorithms Research Group, University of Vienna, Vienna, Austria. Email: {\tt danupon@gmail.com}}
%%
\and Amitabh Trehan\thanks{Information Systems group, Faculty of Industrial Engineering and Management, Technion - Israel Institute of Technology, Haifa, Israel - 32000. \hbox{E-mail}:~{\tt amitabh.trehaan@gmail.com.}
Supported by a Technion fellowship.
}
}


%\author{Author\\Affiliation}
\date{}
\maketitle

\input{abstract}

%\begin{abstract}
%We show that we can maintain an approximated densest subgraph of size at least $k$ in the dynamic networks (edge deletion/addition model).
%\end{abstract}

%\vspace*{.4in}


%\begin{center}
%{\bf Submitted for a Regular Presentation}
%\end{center}


\maketitle

\input introduction

%\input high_level %

\input algorithm % Explain the algorithm and how to implement it in the dynamic distributed setting




\input approximation % Analyze the approximation ratio of the algorithm

\input time % Analyze the running time

%\input extensions % 1) Maintaining some subgraphs so that we can answer the query "what is the density of the densest subgraph of size at least k?" quickly. 2) the more general case of $\rho$-dynamic

\input relatedwork

\input futureworkconclusions


%----------------------------
\newpage
{\small
\bibliographystyle{plain}
\bibliography{dense,selfheal}
}

\newpage
\appendix
\section*{Appendix}
\input count

\input appendix1

%\input appendix2

\input appendix3

%\begin{abstract}


%\end{abstract}

%\section{Introduction}

\end{document}

